-
1 NFA
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > NFA
-
2 indeterministic automaton
недетерминированный [конечный] автомат, HKAконечный автомат, который может находиться сразу в нескольких состояниях, либо автомат, для которого переход задан не функцией, а отношением.Syn:Ant:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > indeterministic automaton
См. также в других словарях:
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Pushdown automaton — In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data. Operation Pushdown automata differ from normal finite state machines in two ways: # They can use the top of the stack to decide… … Wikipedia
List of computing and IT abbreviations — This is a list of computing and IT acronyms and abbreviations. Contents: 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Domain-specific language — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia